Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs

نویسندگان

Bireswar Das

Jacobo Torán

Fabian Wagner

چکیده

The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [2],[19]. We give restricted space algorithms for these problems proving the following results: • Isomorphism for bounded tree distance width graphs is in L and thus complete for the class. We also show that for this kind of graphs a canon can be computed within logspace. • For bounded treewidth graphs, when both input graphs are given together with a tree decomposition, the problem of whether there is an isomorphism which respects the decompositions (i.e. when only isomorphisms are considered, mapping bags in one decomposition blockwise onto bags in the other decomposition) is in L. • For bounded treewidth graphs, when one of the input graphs is given with a tree decomposition the isomorphism problem is in LogCFL. • As a corollary the isomorphism problem for bounded treewidth graphs is in LogCFL. This improves the known TC upper bound for the problem given by Grohe and Verbitsky [8]. Topics: Complexity, Algorithms, Graph Isomorphism Problem, Treewidth, LogCFL.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graph Isomorphism Restricted by Lists

The complexity of graph isomorphism (GraphIso) is a famous unresolved problem in theoretical computer science. For graphs G and H, it asks whether they are the same up to a relabeling. In 1981, Lubiw proved that list restricted graph isomorphism (ListIso) is NP-complete: for each u ∈ V (G), we are given a list L(u) ⊆ V (H) of possible images of u. After 35 years, we revive the study of this pro...

متن کامل

Algorithms for Graphs of (Locally) Bounded Treewidth

Many real-life problems can be modeled by graph-theoretic problems. These graph problems are usually NP-hard and hence there is no efficient algorithm for solving them, unless P= NP. One way to overcome this hardness is to solve the problems when restricted to special graphs. Trees are one kind of graph for which several NP-complete problems can be solved in polynomial time. Graphs of bounded t...

متن کامل

Computing Bounded Path Decompositions in Logspace

The complexity of Graph Isomorphism (GI) is a long-standing open problem. GI is not known to be solvable in polynomial time and is unlikely to be NP-complete [BHZ87, Sch88]. Polynomial-time algorithms are known for GI of several special classes of graphs. One such interesting class is graphs excluding a fixed minor. Any family of graphs that is closed under taking minors falls into this class. ...

متن کامل

Polynomial-time Algorithm for Isomorphism of Graphs with Clique-width at most 3

The clique-width is a measure of complexity of decomposing graphs into certain tree-like structures. The class of graphs with bounded clique-width contains bounded tree-width graphs. While there are many results on the graph isomorphism problem for bounded treewidth graphs, very little is known about isomorphism of bounded cliquewidth graphs. We give the first polynomial-time graph isomorphism ...

متن کامل